Correctness conditions for property nominalists
نویسندگان
چکیده
Abstract Nominalists need some account of correctness for sentences committed to the existence abstract objects. This paper proposes a new statement such conditions specifically properties. The builds on an earlier proposal mine, but avoids counter-examples against latter pointed out by Thomas Schindler, particularly, sentence ‘There are inexpressible properties’. I argue that is independently motivated and more faithful spirit kind error-theoretic nominalism original was part of. Along way, also propose novel treatments Arthur Pap’s W.V.O. Quine’s notoriously hard-to-paraphrase about abstracta.
منابع مشابه
Model-Checking of Correctness Conditions for Concurrent Objects
The notions of serializability, linearizability and sequential consistency are used in the speciication of concurrent systems. We show that the model checking problem for each of these properties can be cast in terms of the containment of one regular language in another regular language shuued using a semi-commutative alphabet. The three model checking problems are shown to be, respectively, in...
متن کاملDefining Correctness Conditions for Concurrent Objects in Multicore Architectures
Correctness of concurrent objects is defined in terms of conditions that determine allowable relationships between histories of a concurrent object and those of the corresponding sequential object. Numerous correctness conditions have been proposed over the years, and more have been proposed recently as the algorithms implementing concurrent objects have been adapted to cope with multicore proc...
متن کاملSemantic Conditions for Correctness at Different Isolation Levels
Many transaction processing applications execute at isolation levels lower than SERIALIZABLE in order to increase throughput and reduce response time. The problem is that non-serializable schedules are not guaranteed to be correct for all applications. The semantics of a particular application determines whether that application will run correctly at a lower isolation level, and in practice it ...
متن کاملOn Correctness of Graph Programs Relative to Recursively Nested Conditions
We propose a new specification language for the proof-based approach to verification of graph programs by introducing μ-conditions as an alternative to existing formalisms which can express path properties. The contributions of this paper are the lifting of constructions from nested conditions to the new, more expressive conditions, and a proof calculus for partial correctness relative to μ-con...
متن کاملCorrectness of Graph Programs Relative to HR + Conditions
In (Pennemann 2009), the correctness of graph programs relative to nested graph conditions is considered. Since these conditions are expressively equivalent to rst-order graph formulas, non-local graph properties in the sense of Gaifman are not expressible by nested graph conditions. We generalize the concept of nested graph conditions to socalled HR conditions and investigate the correctness f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2023
ISSN: ['0039-7857', '1573-0964']
DOI: https://doi.org/10.1007/s11229-023-04206-2